Research Article: Extensions to least-cost path algorithms for roadway planning

نویسندگان

  • Chaoqing Yu
  • Jay Lee
  • Mandy J. Munro-Stasiuk
چکیده

Finding a least-cost-path in a raster data format is a useful function in geographical information systems. However, existing algorithms are often inadequate for practical roadway planning. This paper improves conventional algorithms by including the considerations of spatial distances, anisotropic costs and the presence of bridges and tunnels in the paths. This new algorithm is implemented in JAVA to run with actual remote sensing and DEM data. The experimental results show that this approach produces realistic least-cost paths for practical roadway planning.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Estimation of Reconstruction Cost and Traffic Functionality Relating to Roadway Transportation Lifelines after Natural Disasters

Earthquakes are among those natural hazards which may lead to disruption in the function of arterial traffic routes. Road networks are particularly vulnerable, due to their geographical dispersion, extensive functions and structural reliance on favourable geophysical conditions. Traffic functionality after a natural disaster and the repair/rehabilitation cost of roads are crucial considerations...

متن کامل

Low Cost UAV-based Remote Sensing for Autonomous Wildlife Monitoring

In recent years, developments in unmanned aerial vehicles, lightweight on-board computers, and low-cost thermal imaging sensors offer a new opportunity for wildlife monitoring. In contrast with traditional methods now surveying endangered species to obtain population and location has become more cost-effective and least time-consuming. In this paper, a low-cost UAV-based remote sensing platform...

متن کامل

Study of Evolutionary and Swarm Intelligent Techniques for Soccer Robot Path Planning

Finding an optimal path for a robot in a soccer field involves different parameters such as the positions of the robot, positions of the obstacles, etc. Due to simplicity and smoothness of Ferguson Spline, it has been employed for path planning between arbitrary points on the field in many research teams. In order to optimize the parameters of Ferguson Spline some evolutionary or intelligent al...

متن کامل

ALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS

We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...

متن کامل

Bézier Curve for Trajectory Guidance

In this paper we present two path planning algorithms based on Bézier curves for autonomous vehicles with waypoints and corridor constraints. Bézier curves have useful properties for the path generation problem. The paper describes how the algorithms apply these properties to generate the reference trajectory for vehicles to satisfy the path constraints. Both algorithms join cubic Bézier curve ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • International Journal of Geographical Information Science

دوره 17  شماره 

صفحات  -

تاریخ انتشار 2003